On Generating Complex Numbers for FFT and NCO Using the CORDIC Algorithm

نویسندگان

  • Anton Andersson
  • Anders Nilsson
  • Dake Liu
چکیده

This report has been compiled to document the thesis work carried out by Anton Andersson for Coresonic AB. The task was to develop an accelerator that could generate complex numbers suitable for fast fourier transforms (FFT) and tuning the phase of complex signals (NCO). Of many ways to achieve this, the CORDIC algorithm was chosen. It is very well suited since the basic implementation allows rotation of 2D-vectors using only shift and add operations. Error bounds and proof of convergence are derived carefully The accelerator was implemented in VHDL in such a way that all critical parameters were easy to change. Performance measures were extracted by simulating realistic test cases and then compare the output with reference data precomputed with high precision. Hardware costs were estimated by synthesizing a set of different configurations. Utilizing graphs of performance versus cost makes it possible to choose an optimal configuration. Maximum errors were extracted from simulations and seemed rather large for some configurations. The maximum error distribution was then plotted in histograms revealing that the typical error is often much smaller than the largest one. Even after trouble-shooting, the errors still seem to be somewhat larger than what other implementations of CORDIC achieve. However, precision was concluded to be sufficient for targeted applications. Sammanfattning Den här rapporten dokumenterar det examensarbete som utförts av Anton Andersson för Coresonic AB. Uppgiften bestod i att utveckla en accelerator som kan generera komplexa tal som är lämpliga att använda för snabba fouriertransformer (FFT) och till fasvridning av komplexa signaler (NCO). Det finns en mängd sätt att göra detta men valet föll på en algoritm kallad CORDIC. Den är mycket lämplig då den kan rotera 2D-vektorer godtycklig vinkel med enkla operationer som bitskift och addition. Felgränser och konvergens härleds noggrannt. Acceleratorn implementerades i språket VHDL med målet att kritiska parametrar enkelt skall kunna förändras. Därefter simulerades modellen i realistiska testfall och resulteten jämfördes med referensdata som förberäknats med mycket hög precision. Dessutom syntetiserades en mängd olika konfigurationer så att prestanda enkelt kan viktas mot kostnad. v vi Ur de koefficienter som erhölls genom simuleringar beräknades det största erhållna felet för en mängd olika konfigurationer. Felen verkade till en början onormalt stora vilket krävde vidare undersökning. Samtliga fel från en konfiguration ritades i histogramform, vilket visade att det typiska felet oftast var betydligt mindre än det största. Även efter felsökning verkar acceleratorn generera tal med något större fel än andra implementationer av CORDIC. Precisionen anses dock vara tillräcklig för avsedda applikationer.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and Implementation of Digital Demodulator for Frequency Modulated CW Radar (RESEARCH NOTE)

Radar Signal Processing has been an interesting area of research for realization of programmable digital signal processor using VLSI design techniques. Digital Signal Processing (DSP) algorithms have been an integral design methodology for implementation of high speed application specific real-time systems especially for high resolution radar. CORDIC algorithm, in recent times, is turned out to...

متن کامل

IJSRD - International Journal for Scientific Research & Development| Vol. 3, Issue 10, 2015 | ISSN (online): 2321-0613

In this Paper, the architecture and FPGA implementation of a Coordinate Rotation Digital Computer (CORDIC) pipeline Fast Fourier Transform (FFT) processor is presented. Fast Fourier Transforms (FFT) is highly efficient algorithm which uses Divide and Conquer approach for speedy calculation of Discrete Fourier transform (DFT) to obtain the frequency spectrum. CORDIC algorithm which is hardware e...

متن کامل

Design of 2w4wsk-point Fft Processor Based on Cordic Algorithm in Ofdm Receiver

In this paper, the architecture and the implementation of a 2K/4K/SK-point complex fast Fourier transform (FFT) processor for OFDM system are presented. The processor can perform 8K-point FFT every 273p , and 2K-point every 68.26~s at 30MHz which is enough for OFDM symbol rate. The architecture is based on the Cooley-Tukey algorithm for decomposing the long DFT into short length multi-dimension...

متن کامل

ASIC Design of Butterfly Unit Based on Non-Redundant and Redundant Algorithm

Fast Fourier Transform (FFT) processors employed with pipeline architecture consist of series of Processing Elements (PE) or Butterfly Units (BU). BU or PE of FFT performs multiplication and addition on complex numbers. This paper proposes a single BU to compute radix-2, 8 point FFT in the time domain as well as frequency domain by replacing a series of PEs. This BU comprises of fused floating ...

متن کامل

A CORDIC processor for FFT computation and its implementation using gallium arsenide technology

In this paper, the architecture and the implementation of a complex fast Fourier transform (CFFT) processor using 0.6 m gallium arsenide (GaAs) technology are presented. This processor computes a 1024-point FFT of 16 bit complex data in less than 8 s, working at a frequency beyond 700 MHz, with a power consumption of 12.5 W. The architecture of the processor is based on the COordinate Rotation ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008